Near Optimal Online Algorithms and Fast Approximation Algorithms for Resource Allocation Problems
نویسندگان
چکیده
منابع مشابه
Near-Optimal Online Algorithms for Dynamic Resource Allocation Problems
In this paper, we study a general online linear programming problem whose formulation encompasses many practical dynamic resource allocation problems, including internet advertising display applications, revenue management, various routing, packing, and auction problems. We propose a model, which under mild assumptions, allows us to design near-optimal learning-based online algorithms that do n...
متن کاملFast Approximation Algorithms for Near-optimal Large-scale Network Monitoring
We study the problem of optimal traffic prediction and monitoring in large-scale networks. Our goal is to determine which subset of K links to monitor in order to ”best” predict the traffic on the remaining links in the network. We consider several optimality criteria. This can be formulated as a combinatorial optimization problem, belonging to the family of subset selection problems. Similar N...
متن کاملApproximation algorithms for dynamic resource allocation
We consider a problem of allocating limited quantities of M types of resources among N independent activities that evolve over T epochs. In each epoch, we assign to each activity a task which consumes resources, generates utility, and determines the activity’s subsequent state. We study the complexity of, and approximation algorithms for, maximizing average utility.
متن کاملImproved Approximation Algorithms for Resource Allocation
We study the problem of finding a most profitable subset of n given tasks, each with a given start and finish time as well as profit and resource requirement, that at no time exceeds the quantity B of available resource. We show that this NP-hard Resource Allocation problem can be (1/2−ε)-approximated in polynomial time, which improves upon earlier approximation results for this problem, the be...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the ACM
سال: 2019
ISSN: 0004-5411,1557-735X
DOI: 10.1145/3284177